Second-Order Simple Grammars
نویسنده
چکیده
منابع مشابه
Second-Order Abstract Categorial Grammars as Hyperedge Replacement Grammars
Second-order abstract categorial grammars (de Groote 2001) and hyperedge replacement grammars (see Engelfriet 1997) are two natural ways of generalizing “context-free” grammar formalisms for string and tree languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. 1991) or linear context-free rewriting s...
متن کاملHybrid Type-Logical Grammars, First-Order Linear Logic and the Descriptive Inadequacy of Lambda Grammars
Hybrid type-logical grammars (Kubota & Levine 2012, Kubota & Levine 2013c, Kubota & Levine 2013a) are a relatively new framework in computational linguistics, which combines insights from the Lambek calculus (Lambek 1958) and lambda grammars (Oehrle 1994, Muskens 2001, Muskens 2003)— lambda grammars are also called, depending on the authors, abstract categorial grammars (de Groote 2001) and lin...
متن کاملLittle Tagalog Free Word Order in Bare Grammar
Bare Grammars are a simple and straight-forward model for syntax. Normally, the lexicon in such a grammar is kept very minimal: each lexical item is an ordered pair consisting of the string and its category. However, the simplicity of such a lexicon can make formulating rules that are succinct and that capture grammatical regularities impossible. In this paper I propose that adding more informa...
متن کاملLittle Tagalog
Bare Grammars are a simple and straight-forward model for syntax. Normally, the lexicon in such a grammar is kept very minimal: each lexical item is an ordered pair consisting of the string and its category. However, the simplicity of such a lexicon can make formulating rules that are succinct and that capture grammatical regularities impossible. In this paper I propose that adding more informa...
متن کاملAlternating Regular Tree Grammars in the Framework of Lattice-Valued Logic
In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued) regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...
متن کامل